|
|
|
 |
|
|
|
|
|
|
|
|
|
|
The jogger's problem
|
Bird, R.S.
|
1981 |
Information
Processing Letters
13 (3), pp. 114-117
|
0
|
| | | | |
|
|
Maximum flow in (s,t) planar networks
|
Hassin, R.
|
1981 |
Information
Processing Letters
13 (3), pp. 107
|
16
|
| | | | |
|
|
The cyclic towers of Hanoi
|
Atkinson, M.D.
|
1981 |
Information
Processing Letters
13 (3), pp. 118-119
|
11
|
| | | | |
|
|
On the decidability of equivalence for deterministic pushdown
transducers
|
Ibarra, O.H., Rosier, L.E.
|
1981 |
Information
Processing Letters
13 (3), pp. 89-93
|
3
|
| | | | |
|
|
A parallel merging algorithm
|
Barlow, R.H., Evans, D.J., Shanehchi, J.
|
1981 |
Information
Processing Letters
13 (3), pp. 103-106
|
0
|
| | | | |
|
|
Synchronous communication between asynchronous components
|
Van De Snepscheut, J.L.A.
|
1981 |
Information
Processing Letters
13 (3), pp. 127-130
|
0
|
| | | | |
|
|
More on master keys for group sharing
|
Denning, D.E., Meijer, H., Schneider, F.B.
|
1981 |
Information
Processing Letters
13 (3), pp. 125-126
|
0
|
| | | | |
|
|
Deciding freeness for program schemes with a single unary function
|
Chan, T.-h.
|
1981 |
Information
Processing Letters
13 (3), pp. 98-102
|
0
|
| | | | |
|
|
On weak persistency of petri nets
|
Yamasaki, H.
|
1981 |
Information
Processing Letters
13 (3), pp. 94-97
|
5
|
| | | | |
|
|
On the complexity of vector computations in binary tree machines
|
Tolle, D.M., Siddall, W.E.
|
1981 |
Information
Processing Letters
13 (3), pp. 120-124
|
0
|
| | | | |
|
|
On the subword complexity of DOL languages with a constant
distribution
|
Ehrenfeucht, A., Rozenberg, G.
|
1981 |
Information
Processing Letters
13 (3), pp. 108-113
|
4
|
| | | | |
|
|
GPSS - FINDING THE APPROPRIATE WORLD-VIEW.
|
Henriksen, James O.
|
1981 |
Winter
Simulation Conference Proceedings
2, pp. 505-516
|
1
|
| | | | |
|
|
DATABASE PREPARATION SYSTEM.
|
Kambayashi, Yahiko, Le Viet, Chung, Tokuda, Shigeo, Yajima, Shuzo
|
1981 |
Proceedings
- IEEE Computer Society's International Computer Software and
Applications Conference
, pp. 335-347
|
0
|
| | | | |
|
|
KNOWLEDGE AS AN EXPLANATION FOR CLASSIFICATION EFFECTIVENESS.
|
Noreault, Terry, Dovidio, John F.
|
1981 |
Proceedings
of the ASIS Annual Meeting
18, pp. 337-339
|
0
|
| | | | |
|
|
A general model of query processing in information retrieval
systems
Show Abstract
|
Buell, D.A.
|
1981 |
Information
Processing and Management
17 (5), pp. 249-262
|
6
|
| | | | |
|
|
The shortest common supersequence problem over binary alphabet is
NP-complete
Show Abstract
|
Räihä, K.-J., Ukkonen, E.
|
1981 |
Theoretical
Computer Science
16 (2), pp. 187-198
|
26
|
| | | | |
|
|
Design considerations for MIS in an Executive MBA program
Show Abstract
|
Hoffer, J.A.
|
1981 |
Information
and Management
4 (6), pp. 317-325
|
0
|
| | | | |
|
|
MODULAR PROGRAMMING WITH PASCAL.
Show Abstract
|
Steensgaard-Madsen, J.
|
1981 |
Software
- Practice and Experience
11 (12), pp. 1331-1337
|
1
|
| | | | |
|
|
Parallel random access machines with powerful instruction sets
Show Abstract
|
Savitch, W.J.
|
1981 |
Mathematical
Systems Theory
15 (1), pp. 191-210
|
0
|
| | | | |
|
|
Some scientometric measures of publishing performance for 85 Hungarian
research institutes
Show Abstract
|
Schubert, A., Braun, T.
|
1981 |
Scientometrics
3 (5), pp. 379-388
|
4
|
| | | | |
